Recursive categoricity and recursive stability
نویسندگان
چکیده
Mathematicians, like so many other intellectuals, made a great effort to find a secure foundation for their subject in the latter part of the nineteenth century and this continued into the early twentieth century. For logicians this endeavour culminated in Hilbert's programme. As we all know, this programme suffered a mortal blow from G6del's incompleteness, or better incompletability, theorem; but at the same time mathematics, and mathematical logic in particular, gained immeasurably. Even a very limited consideration of the development of mathematics shows that a conception of a completed body or theory of all mathematics is unhistoric. From the very earliest times, whether because of practical requirements (e.g. for the natural numbers, rational numbers, real numbers, etc.) or for the clarification of concepts and resolution of paradoxes, the conceptual development of mathematics has on the one hand constantly expanded the range and interpretation of such concepts (e.g. by the introduction of negative numbers) and on the other refined and made more precise the concepts then in use (e.g. the development of axiomatic set theory). Because of this, recent attention has shifted to a more anthropological approach perhaps beginning with Brouwer's criticism of Dedekind (Brouwer (1975), p. [73]) and more recently developed by Lakatos (1976), Crossley (1980) and Hersh (1979). This change of orientation has been accompanied by a dramatic development of practical computing devices at the same time as a strong growth of theoretical computing (recursive function theory). Recently the techniques developed for purely abstract recursion-theoretic work have been applied to give a much more thorough analysis of nineteenth century algebra (and to a more limited extent of analysis and topology). At present there are three schools (for want of a better
منابع مشابه
The eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کاملDegrees of Categoricity and the Hyperarithmetic Hierarchy
We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of Fokina, Kalimullin, and R. Miller to show that for every computable ordinal α, 0 is the degree of categoricity of some computable structure A. We show additionally that for α a computable successor ordinal, every degree 2-c.e. in and above 0 is a degree of categoricity. We further prove that every degree of c...
متن کاملThe Diversity of Categoricity without Delay
We suggest several new ways to compare fully primitive recursive presentations of a structure. Properties of this kind have never been seen in computable structure theory. We prove that these new definitions are nonequivalent. In this note we give only proof sketches, complete proof will appear in the full version of the paper.
متن کاملA New Recursive Formulation for the Mixed Redundancy Strategy in Reliability Optimization Problems
One of the common approaches for improving the reliability of a specific system is to use parallel redundant components in subsystems. This approach, which is known as the redundancy allocation problem (RAP), includes the simultaneous selection of the component type and its level for each subsystem in order to maximize the system reliability.Traditionally, there are two redundancy strategies, n...
متن کاملOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
متن کاملA Novel Reference Current Calculation Method for Shunt Active Power Filters using a Recursive Algebraic Approach
This paper presents a novel method to calculate the reference source current and the referencecompensating current for shunt active power filters (SAPFs). This method first calculates theamplitude and phase of the fundamental load current from a recursive algebraic approach blockbefore calculating the displacement power factor. Next, the amplitude of the reference mains currentis computed with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 31 شماره
صفحات -
تاریخ انتشار 1986